m-compositions and m-partitions: exhaustive generation and Gray code
نویسندگان
چکیده
In this paper we give an exhaustive generation algorithm for the class of m-compositions of integers with fixed m. Moreover we define a Gray code to list these combinatorial objects according to a particular order. Finally, we define m-partitions, which are an m-dimensional generalization of integer partitions, and an exhaustive generation algorithm for m-partitions, based on the same ideas used for m-compositions, is given. Mathematics Subject Classifications (2000). 68R05
منابع مشابه
Subset-lex: did we miss an order?
We generalize a well-known algorithm for the generation of all subsets of a set in lexicographic order with respect to the sets as lists of elements (subset-lex order). We obtain algorithms for various combinatorial objects such as the subsets of a multiset, compositions and partitions represented as lists of parts, and for certain restricted growth strings. The algorithms are often loopless an...
متن کاملGray Codes, Loopless Algorithm and Partitions
The generation of efficient Gray codes and combinatorial algorithms that list all the members of a combinatorial object has received a lot of attention in the last few years. Knuth gave a code for the set of all partitions of [n] = {1, 2, . . . , n}. Ruskey presented a modified version of Knuth’s algorithm with distance 2. Ehrlich introduced a looplees algorithm for the set of the partitions of...
متن کاملCombinatorial Gray codes for classes of pattern avoiding permutations
The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhaustive generation of permutations subject to various constraints or imposing a particular generating order. In this paper we present generating algorithms and combinatorial Gray codes for several families of pattern avoid...
متن کاملPartitions and Compositions over Finite Fields
In this paper we find an exact formula for the number of partitions of an element z into m parts over a finite field, i.e. we find the number of nonzero solutions of the equation x1 + x2 + · · ·+ xm = z over a finite field when the order of terms does not matter. This is equivalent to counting the number of m-multi-subsets whose sum is z. When the order of the terms in a solution does matter, s...
متن کاملCorrections to the results derived in "A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions"'; and a comparison of four restricted integer composition generation algorithms
In this note, I discuss results on integer compositions/partitions given in the paper “A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions”. I also experiment with four different generation algorithms for restricted integer compositions and find the algorithm designed in the named paper to be pretty slow, comparatively. Some of my ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007